Computation of Invariants for Algebraic Petri Nets
نویسنده
چکیده
Abstract In the first part of this article we discuss the definition of Pand T–invariants for algebraic Petri nets. Thereby we stress the strong relation of these concepts with those for colored Petri nets. This part contains furthermore a comparison with the concepts defined in [Rei91], where first algebraic nets, invariant concepts and the main theorems concerning invariants have been presented. The second part deals with an idea for the calculation of T–invariants. The main part of this idea is to trace back the equation C · I = 0 to a set of term equations which can be solved applying the well known concept of unification. The work related to this article is supported by the Sonderforschungsbereich 342 of the Deutsche Forschungsgemeinschaft
منابع مشابه
On the Computation of Place Invariants for Algebraic Petri Nets
The paper is concerned with the computation of a generator set for the space of all place invariants for a given algebraic net. We will show that the problem can be divided into two major steps. First we trace back the problem to a set of equations between terms. Then we combine the solutions of these equations to obtain the solution of the original problem. For both steps we present a solution...
متن کاملFlexibility in Algebraic Nets
Algebraic Petri nets as deened by Reisig 15] lack a feature for modelling distributed network algorithms, viz. exible arcs. In this paper we equip algebraic Petri nets with exible arcs and we call the resulting extension algebraic system nets. We demonstrate that algebraic system nets are better suited for modelling distributed algorithms. Besides this practical motivation for introducing algeb...
متن کاملT–Invariants of Algebraic Petri Nets
A detailed observation of the structure of T–invariants leads to the definition of a subset of invariants, which generates the whole set of invariants by linear combination and instantiation and the elements of which have a simple structure by means of computation. Then an algorithmically insoluble problem concerning T–invariants is presented to justify the non–termination of the algorithm whic...
متن کاملComposition of Functional Petri Nets
Functional Petri nets and subnets are introduced and studied for the purpose of speed-up of Petri nets analysis with algebraic methods. The authors show that any functional subnet may be generated by a composition of minimal functional subnets. They propose two ways to decompose a Petri net: via logical equations solution and with an ad-hoc algorithm, whose complexity is polynomial. Then proper...
متن کاملReenement versus Veriication: Compatibility of Net Invariants and Stepwise Development of High-level Petri Nets
The concept of rule-based modiication developed in the area of algebraic graph transformations and high-level replacement systems has recently shown to be a powerful concept for vertical stucturing of Petri nets. This includes low-level and high-level Petri nets, especially algebraic high-level nets which can be considered as an integration of algebraic speciications and Petri nets. In a large ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994